Approximation algorithm - PDFSEARCH.IO - Document Search Engine

Approximation algorithm
Results: 454

#	Item
171	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Terminal Steiner Tree with Bounded Edge Length Zhiyong Lin∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:29:26 NP-complete problems Spanning tree Steiner tree problem Minimum spanning tree Time complexity Approximation algorithm Rectilinear Steiner tree Theoretical computer science Graph theory Computational complexity theory
172	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Medial Axis Approximation of Planar Shapes from Union of Balls: A Simpler and more Robust Algorithm Joachim Giesen∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:24:37 Diagrams Discrete geometry Voronoi diagram Triangulation Medial axis Delaunay triangulation Polyhedron Proximity problems Convex hull Geometry Computational geometry Mathematics
173	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximating k-hop Minimum Spanning Trees in Euclidean Metrics∗ S¨oren Laue† Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:19 Operations research Spanning tree Complexity classes NP-complete problems Minimum spanning tree Steiner tree problem R-tree Approximation algorithm Facility location Theoretical computer science Computational complexity theory Applied mathematics
174	IEEE TRANSACTIONS ON ROBOTICS, VOL. 23, NO. 5, OCTOBERApproximate Algorithms for a Collaboratively Controlled Robotic Camera Add to Reading List Source URL: www.ieor.berkeley.edu Language: English - Date: 2007-10-15 15:12:36 Operations research Computational complexity theory Convex optimization Linear programming Approximation algorithm Algorithm Lattice Mathematics Theoretical computer science Applied mathematics
175	A Theory and Algorithms for Combinatorial Reoptimization? Hadas Shachnai1?? , Gal Tamir1 , and Tami Tamir2 1 2 Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-02-29 12:43:33 Operations research Complexity classes NP-complete problems Approximation algorithm Optimization problem Reduction NP Knapsack problem Dynamic programming Theoretical computer science Applied mathematics Computational complexity theory
176	Join seminar The Hong Kong University of Science and Technology Approximation Algorithms for Perishable Inventory Systems Dr. Xiting Gong Add to Reading List Source URL: www.bm.ust.hk Language: English - Date: 2014-03-13 04:17:53 Supply chain management Marketing Computational complexity theory Approximation algorithm Inventory Systems engineering Business Technology Operations research
177	Adaptive Informative Path Planning in Metric Spaces Zhan Wei Lim, David Hsu, and Wee Sun Lee National University of Singapore, Singapore, Singapore Abstract. In contrast to classic robot motion planning, informati Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2014-07-16 20:39:51 Operations research Approximation algorithm Computational complexity theory Travelling salesman problem Algorithm XTR Theoretical computer science Mathematics Applied mathematics
178	Sparse solutions for linear prediction problems by Tyler Neylon A dissertation submitted in partial fulfillment of the requirements for the degree of Add to Reading List Source URL: www.cs.nyu.edu Language: English - Date: 2009-01-13 11:54:22 Mathematics Sparse matrix Preconditioner Algorithm Gaussian elimination Kernel Sparse approximation Algebra Numerical linear algebra Linear algebra
179	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 A Distributed Algorithm for Approximate Mobile Sensor Coverage Esther Ezra∗ Jiemin Zeng† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-07-29 13:44:18 NP-complete problems Complexity classes Approximation algorithms Operations research Set cover problem Polynomial-time approximation scheme Time complexity Linear programming relaxation NP Theoretical computer science Computational complexity theory Applied mathematics
180	Action Pruning Through Under-approximation Refinement Master’s Thesis Natural Science Faculty of the University of Basel Department of Mathematics and Computer Science Add to Reading List Source URL: ai.cs.unibas.ch Language: English - Date: 2014-06-04 05:49:32 Science Mind Operations research Automated planning and scheduling Heuristic function Heuristic Algorithm Search algorithm Planning Domain Definition Language Problem solving Artificial intelligence Heuristics

UPDATE